Preemptive scheduling in overloaded systems
نویسندگان
چکیده
منابع مشابه
Preemptive Scheduling for Distributed Systems
Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing and metacomputing. Non-preemptive scheduling can perform well if the task lengths and processor sp...
متن کاملPreemptive Task Scheduling for Distributed Systems
Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not received muc...
متن کاملPreemptive uniprocessor scheduling for mixed-criticality systems
In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...
متن کاملSMT-Based Scheduling for Overloaded Real-Time Systems
In a real-time system, tasks are required to be completed before their deadlines. Under normal workload conditions, a scheduler with a proper scheduling policy can make all the tasks meet their deadlines. However, in practical environment, system workload may vary widely. Once system workload becomes too heavy, so that there does not exist a feasible schedule can make all the tasks meet their d...
متن کاملAn Incremental Server for Scheduling Overloaded Real-Time Systems
The need for supporting dynamic real-time environments where changes in workloads occur frequently requires a scheduling framework that: 1) explicitly addresses overload conditions, 2) allows the system to achieve graceful degradation while guaranteeing the deadlines of the most critical tasks in the system, and 3) supports an efficient runtime selection mechanism capable of determining the loa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00070-9